AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms
نویسندگان
چکیده
منابع مشابه
Learning Causal AMP Chain Graphs
Andersson-Madigan-Perlman chain graphs were originally introduced to represent independence models. They have recently been shown to be suitable for representing causal models with additive noise. In this paper, we present an algorithm for learning causal chain graphs. The algorithm builds on the ideas by Hoyer et al. (2009), i.e. it exploits the nonlinearities in the data to identify the direc...
متن کاملMinimal Separators in Intersection Graphs
In this report, we present the intersection graphs and describe the role they play in computations of treewidth. We introduce minimal triangulations, minimal separators, potential maximal cliques and blocks as the main tools for exact computation and approximation of that important graph parameter. The first chapter is an introduction to the intersection graph theory. We give all the necessary ...
متن کاملLearning AMP Chain Graphs under Faithfulness
This paper deals with chain graphs under the alternative Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. We also show that the extension of Meek’s conjecture to AMP chain graphs does not hold, which compromises the development of efficient and correct score+sea...
متن کاملLearning Marginal AMP Chain Graphs under Faithfulness
Marginal AMP chain graphs are a recently introduced family of models that is based on graphs that may have undirected, directed and bidirected edges. They unify and generalize the AMP and the multivariate regression interpretations of chain graphs. In this paper, we present a constraint based algorithm for learning a marginal AMP chain graph from a probability distribution which is faithful to ...
متن کاملMinimal separators in P4-sparse graphs
In this paper, we determine the minimal separators of P4-sparse graphs and establish bounds on their number. Specifically, we show that a P4-sparse graph G on n vertices and m edges has fewer than 2n/3 minimal separators of total description size at most 4m/3. The bound on the number of minimal separators is tight and is also tight for the class of cographs, a well known subclass of the P4-spar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2020
ISSN: 1076-9757
DOI: 10.1613/jair.1.12101